CSE 525 : Randomized Algorithms and Probabilistic Analysis Lecture 6 Lecturer : Anna
نویسندگان
چکیده
Online Bipartite Matching is a generalization of a well-known Bipartite Matching problem. In a Bipartite Matching, we a given a bipartite graph G = (L,R,E), and we need to find a matching M ⊆ E such that no edges in M have common endpoints. In the online version L is known, but vertices in R are arriving one at a time. When vertex j ∈ R arrives (with all its edges), we need to make an irreversible decision to match j with one of its neighbors i ∈ N(j) ⊆ L. Performance of different algorithms A (possible randomized) in comparison to optimal (offline) algorithm is called competitive ratio:
منابع مشابه
Cse525: Randomized Algorithms and Probabilistic Analysis Lecture 1
The main theme of this class is randomized algorithms. We start by comparing these to the deterministic algorithms to which we are so accustomed. In the deterministic model of computation (Turing machines and RAM), an algorithm has fixed behavior on every fixed input. In contrast, in the randomized model of computation, algorithms take additional input consisting of a stream of random bits. The...
متن کاملCse525: Randomized Algorithms and Probabilistic Analysis Lecture 7 2 Linear Program Formulation
In congestion minimization we are given a directed graph and a set of pairs of nodes that we wish to connect with (possibly non-disjoint) paths while minimizing the maximum use of any edge. Formally we are given a directed graph G = (V,E) and a set of pairs (si, ti) for i = 1, . . . , k. We need to compute a path Pi from si to ti for i = 1, . . . , k, such that the congestion C is minimized whe...
متن کاملLecture 2 : Concentration Bounds Lecturer : Shayan
Laws of large numbers imply for a sequence of i.i.d. random variables X1, X2, . . . with mean μ, the sample average, 1 n (X1 + X2 + · · · + Xn), converges to μ as n goes to infinity. Concentration bounds provide a quantitative distance between the sample average and the expectation. In this lecture we review several of these fundamental inequalities. In the next few lectures we will see applica...
متن کاملCs294-1 On-line Computation & Network Algorithms Lecture 21: April 17
Spring 1997 Lecture 21: April 17 Lecturer: Yair Bartal Scribe: Tzu-Yi Chen This is the third of a series of lectures on probabilistic approximate metric spaces [Bartal96]. This lecture states a theorem relating probabilistic partitions to k-HST trees and then proves it. At the end of the lecture we brie y discuss why probabilistic approximate metric spaces are useful in practice. 21.1 Probabili...
متن کامل